Algorithmic game theory

Results: 153



#Item
11

Lectures on Combinatorial Auctions∗ Tim Roughgarden† October 18, 2008 These are lecture notes for one third of the class CS364B, Topics in Algorithmic Game Theory, offered at Stanford University in the Fall 2005 term

Add to Reading List

Source URL: theory.stanford.edu

- Date: 2008-10-18 22:03:27
    12

    CS364A: Algorithmic Game Theory Lecture #17: No-Regret Dynamics∗ Tim Roughgarden† November 18, 2013 This lecture continues to study the questions introduced last time. Do strategic players reach an equilibrium of a g

    Add to Reading List

    Source URL: theory.stanford.edu

    - Date: 2016-08-30 19:06:23
      13

      CS364A: Algorithmic Game Theory Lecture #13: Potential Games; A Hierarchy of Equilibria∗ Tim Roughgarden† November 4, 2013 Last lecture we proved that every pure Nash equilibrium of an atomic selfish routing

      Add to Reading List

      Source URL: theory.stanford.edu

      - Date: 2016-08-30 19:04:46
        14

        CS364A: Algorithmic Game Theory Lecture #1: Introduction and Examples∗ Tim Roughgarden† September 23,

        Add to Reading List

        Source URL: theory.stanford.edu

        - Date: 2016-08-30 18:55:42
          15

          CS364A: Algorithmic Game Theory Lecture #16: Best-Response Dynamics∗ Tim Roughgarden† November 13,

          Add to Reading List

          Source URL: theory.stanford.edu

          - Date: 2016-08-30 19:05:59
            16

            CS364A: Algorithmic Game Theory Lecture #19: Pure Nash Equilibria and PLS-Completeness∗ Tim Roughgarden† December 2, 2013

            Add to Reading List

            Source URL: theory.stanford.edu

            - Date: 2016-08-30 19:09:32
              17

              CS364A: Algorithmic Game Theory Lecture #11: Selfish Routing and the Price of Anarchy∗ Tim Roughgarden† October 28,

              Add to Reading List

              Source URL: theory.stanford.edu

              - Date: 2016-08-30 19:03:35
                18

                CS364A: Algorithmic Game Theory Lecture #3: Myerson’s Lemma∗ Tim Roughgarden† September 30,

                Add to Reading List

                Source URL: theory.stanford.edu

                - Date: 2016-08-30 18:57:31
                  19

                  CS364A: Algorithmic Game Theory Lecture #14: Robust Price-of-Anarchy Bounds in Smooth Games∗ Tim Roughgarden† November 6, 2013

                  Add to Reading List

                  Source URL: theory.stanford.edu

                  - Date: 2016-08-30 19:05:12
                    20

                    CS364A: Algorithmic Game Theory Lecture #8: Combinatorial and Wireless Spectrum Auctions∗ Tim Roughgarden† October 16, 2013

                    Add to Reading List

                    Source URL: theory.stanford.edu

                    - Date: 2016-08-30 19:01:44
                      UPDATE